Coloring Triple Systems with Local Conditions
نویسنده
چکیده
We produce an edge-coloring of the complete 3-uniform hypergraph on n vertices with e √ log logn) colors such that the edges spanned by every set of five vertices receive at least three distinct colors. This answers the first open case of a question of Conlon-Fox-Lee-Sudakov [1] who asked whether such a coloring exists with (log n) colors.
منابع مشابه
Strict colorings of Steiner triple and quadruple systems: a survey
The paper surveys problems, results and methods concerning the coloring of Steiner Triple and Quadruple Systems viewed as mixed hypergraphs. In this setting, two types of conditions are considered: each block of the Steiner system in question has to contain (i) a monochromatic pair of vertices, or, more restrictively, (ii) a triple of vertices that meets precisely two color classes.
متن کاملObligatory subsystems of triple systems
We determine a class of triple systems such that each must occur in a triple system with uncountable chromatic number that omits T0 (the system consisting of two triples on four vertices). This class contains all odd circuit of length ≥ 7. We also show that consistently there are two finite triple systems such that they can separately be omitted by uncountably chromatic triple systems but not b...
متن کاملCirculants and the Chromatic Index of Steiner Triple Systems
We complete the determination of the chromatic number of 6valent circulants of the form C(n; a, b, a+b) and show how this can be applied to improving the upper bound on the chromatic index of cyclic Steiner triple systems.
متن کاملBalanced Steiner Triple Systems
A Steiner triple system of order v (briefly STS(v)) is a pair (X, B), where X is a v-element set and B is a collection of 3-subsets of X (triples), such that every pair of X is contained in exactly one triple of B. It is well known that a necessary and sufficient condition for a STS(v) to exist is that v#1 or 3 (mod 6). An r-coloring of a STS(v) is a map , : X [1, ..., r] such that at least two...
متن کاملEquitable edge coloured Steiner triple systems
A k-edge coloring of G is said to be equitable if the number of edges, at any vertex, colored with a certain color differ by at most one from the number of edges colored with a different color at the same vertex. An STS(v) is said to be polychromatic if the edges in each triple are colored with three different colors. In this paper, we show that every STS(v) admits a 3-edge coloring that is bot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 81 شماره
صفحات -
تاریخ انتشار 2016